An Improved Variable Kernel Density Estimator Based on L2 Regularization
نویسندگان
چکیده
The nature of the kernel density estimator (KDE) is to find underlying probability function (p.d.f) for a given dataset. key training KDE determine optimal bandwidth or Parzen window. All data points share fixed (scalar univariate and vector multivariate KDE) in (FKDE). In this paper, we propose an improved variable (IVKDE) which determines each point dataset based on integrated squared error (ISE) criterion with L2 regularization term. An effective optimization algorithm developed solve objective function. We compare estimation performance IVKDE FKDE VKDE ISE without four distributions. experimental results show that obtains lower errors thus demonstrate effectiveness IVKDE.
منابع مشابه
An Empirical Bayesian Kernel Density Estimator
Often times there is a need to infer the true underlying probability based on the observations, such as in, including but not limited to, data-mining, optimizing the process control parameters etc., Histograms, very rudimentary empirical density estimators, divide the whole data range into either equal or unequal sub intervals (bins) and then obtain the frequency of occurrence of each bin. They...
متن کاملGoodness-of-fit Tests Based on the Kernel Density Estimator
Given an i.i.d. sample drawn from a density f on the real line, the problem of testing whether f is in a given class of densities is considered. Testing procedures constructed on the basis of minimizing the L1-distance between a kernel density estimate and any density in the hypothesized class are investigated. General non-asymptotic bounds are derived for the power of the test. It is shown tha...
متن کاملNovelty detection employing an L2 optimal non-parametric density estimator
This paper considers the application of a recently proposed L2 optimal nonparametric Reduced Set Density Estimator to novelty detection and binary classification and provides empirical comparisons with other forms of density estimation as well as Support Vector Machines.
متن کاملKernel Density Feature Points Estimator for Content-Based Image Retrieval
Research is taking place to find effective algorithms for content-based image representation and description. There is a substantial amount of algorithms available that use visual features (color, shape, texture). Shape feature has attracted much attention from researchers that there are many shape representation and description algorithms in literature. These shape image representation and des...
متن کاملKernel density classification and boosting: an L2 analysis
Kernel density estimation is a commonly used approach to classification. However, most of the theoretical results for kernel methods apply to estimation per se and not necessarily to classification. In this paper we show that when estimating the difference between two densities, the optimal smoothing parameters are increasing functions of the sample size of the complementary group, and we provi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9162004